Perfect r-domination in the Kronecker product of two cycles, with an application to diagonal/toroidal mesh
نویسنده
چکیده
If r 1, and m and n are each a multiple of (r + 1)2 + r2, then each isomorphic component of Cm ×Cn admits of a vertex partition into (r + 1)2 + r2 perfect r-dominating sets. The result induces a dense packing of Cm × Cn by means of vertexdisjoint subgraphs, each isomorphic to a diagonal array. Areas of applications include efficient resource placement in a diagonal mesh and error-correcting codes. 2003 Elsevier B.V. All rights reserved.
منابع مشابه
On independent domination numbers of grid and toroidal grid directed graphs
A subset $S$ of vertex set $V(D)$ is an {em indpendent dominating set} of $D$ if $S$ is both an independent and a dominating set of $D$. The {em indpendent domination number}, $i(D)$ is the cardinality of the smallest independent dominating set of $D$. In this paper we calculate the independent domination number of the { em cartesian product} of two {em directed paths} $P_m$ and $P_n$ for arbi...
متن کاملTotal and paired domination numbers of toroidal meshes
Let G be a graph without isolated vertices. The total domination number of G is the minimum number of vertices that can dominate all vertices in G, and the paired domination number of G is the minimum number of vertices in a dominating set whose induced subgraph contains a perfect matching. This paper determines the total domination number and the paired domination number of the toroidal meshes...
متن کاملتخمین جهت منابع با استفاده از زیرفضای کرونکر
This paper proceeds directions of arrival (DOA) estimation by a linear array. These years, some algorithms, e.g. Khatri-Rao approach, Nested array, Dynamic array have been proposed for estimating more DOAs than sensors. These algorithms can merely estimate uncorrelated sources. For Khatri-Rao approach, this is due to the fact that Khatri-Rao product discard the non-diagonal entries of the corre...
متن کاملDiagonal and Toroidal Mesh Networks
Ah&z&-Diagonal and toroidal mesh are degree-4, point to point intercoimection models suitable for connecting communication elements in parallel computers, particularly multicomputers. The two networks have a similar structure. The toroidai mesh is popular and well-studied whereas tbe diagonal mesh is relatively new. In this paper, we show that the diagonal mesh has a smaller diameter and a larg...
متن کاملOn the outer independent 2-rainbow domination number of Cartesian products of paths and cycles
Let G be a graph. A 2-rainbow dominating function (or 2-RDF) of G is a function f from V(G) to the set of all subsets of the set {1,2} such that for a vertex v ∈ V (G) with f(v) = ∅, thecondition $bigcup_{uin N_{G}(v)}f(u)={1,2}$ is fulfilled, wher NG(v) is the open neighborhoodof v. The weight of 2-RDF f of G is the value$omega (f):=sum _{vin V(G)}|f(v)|$. The 2-rainbowd...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 87 شماره
صفحات -
تاریخ انتشار 2003